An achievable rate region for the broadcast channel

نویسنده

  • Thomas M. Cover
چکیده

Let p( yl, y2 1 X) denote a discrete memoryless channel with a single source X and two independent receivers YI and Y2. W e exhibit an achievable region of rates (R11,R12,R22) at which independent information can be sent, respectively, to receiver 1, to both receivers 1 and 2, and to receiver 2. The achievability of the region is shown by using a version of the asymptotic equipartit ion property involving many simultaneous “typicality” constraints. These results immediately general ize to yield an achievable rate region for the m-sender n-receiver channel in terms of s tandard mutual information quantities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

متن کامل

On the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels

In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...

متن کامل

Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels

Abstract— We consider a multi-user multiple input multiple output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO broadcast channel is in general a non-degraded broadcast channel, its capacity region remains an unsolved problem. In this paper, we establish a duality between what is termed the “dirty paper” achievable region (the...

متن کامل

A new coding theorem for three user discrete memoryless broadcast channel

We propose a new coding technique based on nested coset codes and derive a new achievable rate region for a general three user discrete memoryless broadcast channel (DMBC). We identify an example of a three user binary broadcast channel for which the proposed achievable rate region strictly outperforms that obtained by a natural extension of Marton’s [1] rate region. As a step towards deriving ...

متن کامل

Achievable Rate Region of Quantized Broadcast and MAC Channels

Abstract—In this paper, we study the achievable rate region of Gaussian multiuser channels with the messages transmitted being from finite input alphabets and the outputs being quantized at the receiver. In particular, we focus on the achievable rate region of i) Gaussian broadcast channel (GBC) and ii) Gaussian multiple access channel (GMAC). First, we study the achievable rate region of two-u...

متن کامل

On the capacity of multiple input multiple output broadcast channels

Abstract— We consider a multi-user multiple input multiple output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO broadcast channel is in general a non-degraded broadcast channel, its capacity region remains an unsolved problem. In this paper, we establish a duality between what is termed the “dirty paper” achievable region (the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1975